翻訳と辞書 Words near each other ・ Fastjet Zimbabwe ・ FASTK ・ FASTKD1 ・ FASTKD2 ・ Fast track (trade) ・ Fast Track English ・ Fast Track High Court ・ Fast Track Love ・ Fast Track to Nowhere ・ Fast Train ・ Fast Train (disambiguation) ・ Fast Train (film) ・ Fast Universal Digital Computer M-2 ・ Fast user switching ・ Fast Virtual Disk ・ Fast Walsh–Hadamard transform ・ Fast wavelet transform ・ Fast Web Media ・ Fast wia im richtigen Leben ・ Fast Workers ・ Fast Yellow AB ・ FAST – Fighting Antisemitism Together ・ Fast, Cheap & Out of Control ・ Fast, Cheap and Out of Control (album) ・ Fast-a-Thon ・ Fast-growing hierarchy ・ Fast-man ・ Fast-men ・ Fast-moving consumer goods ・ Fast-neutron reactor Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Fast Walsh–Hadamard transform ： ウィキペディア英語版 Fast Walsh–Hadamard transform In computational mathematics, the Hadamard ordered fast Walsh–Hadamard transform (FWHTh) is an efficient algorithm to compute the Walsh–Hadamard transform (WHT). A naive implementation of the WHT would have a computational complexity of O($N^2$). The FWHTh requires only $N\; \backslash log\; N$ additions or subtractions. The FWHTh is a divide and conquer algorithm that recursively breaks down a WHT of size $N$ into two smaller WHTs of size $N/2$. This implementation follows the recursive definition of the $2N\; \backslash times\; 2N$ Hadamard matrix $H\_N$: : The $1/\backslash sqrt2$ normalization factors for each stage may be grouped together or even omitted. The sequency ordered, also known as Walsh ordered, fast Walsh–Hadamard transform, FWHTw, is obtained by computing the FWHTh as above, and then rearranging the outputs. == See also == * Fast Fourier transform 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Fast Walsh–Hadamard transform」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.